Reasoning About Social Choice Functions

Reasoning About Social Choice Functions

We introduce a logic specifically designed to support reasoning about social choice functions. The logic includes operators to capture strategic ability, and operators to capture agent preferences. We establish a correspondence between formulae in the logic and properties of social choice functions, and show that the logic is expressively complete with respect to social choice functions, i.e., ...

Reasoning about Choice

We present a logic for reasoning about choice. Choice CTL (C-CTL) extends the well-known branching-time temporal logic CTL with choice modalities, “3” and “2”. An example C-CTL formula is 3AFhappy , asserting that there exists a choice that will lead to happiness. C-CTL is related to both STIT logics and temporal cooperation logics such as ATL, but has a much simpler and (we argue) more intuiti...

Reasoning about Functions with Eeects

Reasoning about social choices and social relationships

We study inferences about social choices—choices that affect people besides the chooser. Social choices depend on the relationships between the people involved: for example, whether they are friends, strangers, or enemies. We propose that these different social relationships correspond to different ways in which the chooser weights another person’s utility relative to her own. We describe a pro...

Self-selective social choice functions

It is not uncommon that a society facing a choice problem has also to choose the choice rule itself. In such situations, when information about voters' preferences is complete, the voters' preferences on alternatives induce voters' preferences over the set of available voting rules. Such a setting immediately gives rise to a natural question concerning consistency between these two levels of ch...